翻訳と辞書
Words near each other
・ Complexe Sportif René Tys
・ Complexification
・ Complexification (Lie group)
・ Complexin
・ Complexion
・ Complexions Contemporary Ballet
・ Complexity
・ Complexity (disambiguation)
・ Complexity (journal)
・ Complexity class
・ Complexity economics
・ Complexity function
・ CompLexity Gaming
・ Complexity index
・ Complexity management
Complexity of constraint satisfaction
・ Complexity paradox
・ Complexity theory
・ Complexity theory and organizations
・ Complexity, Problem Solving, and Sustainable Societies
・ Complexo - Universo Paralelo
・ Complexo Desportivo Adega
・ Complexo Desportivo Conde de Sucena
・ Complexo Desportivo da Covilhã
・ Complexo do Alemão
・ Complexo do Alemão massacre
・ Complexometric indicator
・ Complexometric titration
・ Complexor
・ Compliance


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Complexity of constraint satisfaction : ウィキペディア英語版
Complexity of constraint satisfaction

The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction problems on finite domains.
Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general. Research has shown a number of polynomial-time subcases, mostly obtained by restricting either the allowed domains or constraints or the way constraints can be placed over the variables. Research has also established relationship of the constraint satisfaction problem with problems in other areas such as finite model theory and databases.
==Overview==

Establishing whether a constraint satisfaction problem on a finite domain has solutions is an NP complete problem in general. This is an easy consequence of a number of other NP complete problems being expressible as constraint satisfaction problems. Such other problems include propositional satisfiability and three-colorability.
Tractability can be obtained by considering specific classes of constraint satisfaction problems. As an example, if the domain is binary and all constraints are binary, establishing satisfiability is a polynomial-time problem because this problem is equivalent to 2-SAT, which is tractable. Research has shown a number of tractable subcases. Some of these classes are based on restricting the allowed domains or relations, some on restricting the way constraints are placed over variables, and some on both kinds of restrictions.
One line of research used a correspondence between constraint satisfaction problem and the problem of establishing the existence of a homomorphism between two relational structures. This correspondence has been used to link constraint satisfaction with topics traditionally related to database theory.
A considered research problem is about the existence of dichotomies among sets of restrictions. This is the question of whether a set of restrictions contains only polynomial-time restrictions and NP-complete restrictions. This question is settled for some sets of restrictions, but still open for the set of all restrictions based on a fixed domain and set of relations, . This is considered by some authors the most important open question about the complexity of constraint satisfaction.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Complexity of constraint satisfaction」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.